Parallel Solutions of the Longest Increasing Subsequence Problem Using Pipelined Optical Bus Systems
نویسندگان
چکیده
In this paper we give parallel solutions to the problem of finding the Longest Increasing Subsequence of a given sequence of n integers. First, we show the existence of a simple dynamic programming solution. Its running time is Θ(n) and its space requirement is Θ(n). Then, we continue by showing that it is possible to develop two parallel solutions based on optical bus system of n processors, one using Θ(n) communication cycles and the other using Θ(1) communication cycle.
منابع مشابه
Fast Parallel Algorithms for the Longest Common Subsequence Problem Using an Optical Bus
A parallel algorithm for the longest common subsequence problem on LARPBS is presented. For two sequences of lengths m and n, the algorithm uses p processors and costs O(mn/p) computation time where 1 ≤ p ≤ max{m, n}. Time-area cost of the algorithm is O(mn/p) and memory space required is O((m+n)/p) which all reach optimal. We also show this algorithm is scalable when the number of processors p...
متن کاملParallel Matrix Computations Using a Reconfigurable Pipelined Optical Bus
We present fast and cost-efficient parallel algorithms for a number of important and fundamental matrix computation problems on linear arrays with reconfigurable pipelined optical bus systems. These problems include computing the inverse, the characteristic polynomial, the determinant, the rank, the Nth power, and an LUand a QR-factorization of a matrix and solving linear systems of equations. ...
متن کاملSingular value decomposition on processor arrays with a pipelined bus system
Singular value decomposition (SVD) is used in many applications such as real-time signal processing where fast computation of these problems is needed. In this paper, parallel algorithms for solving the singular value decomposition problem are discussed. The algorithms are designed for optically interconnected multiprocessor systems where pipelined optical buses are used to connect processors. ...
متن کاملSolving the Longest Common Subsequence (LCS) Problem using the Associative ASC Processor with Reconfigurable 2D Mesh
Solving the Longest Common Subsequence (LCS) Problem using the Associative ASC Processor with Reconfigurable 2D Mesh Virdi Sabegh Singh, Hong Wang, Robert A. Walker Computer Science Department, Kent State University, Kent OH 44242 USA Abstract As new genes are sequenced, it is necessary for molecular biologists to compare the new gene’s biosequence to known sequences. One simple form of DNA seq...
متن کاملA Load Balancing Technique for Some Coarse-Grained Multicomputer Algorithms
The paper presents a load balancing method for some CGM (Coarse-Grained Multicomputer) algorithms. This method can be applied on different dynamic programming problems such as: Longest Increasing Subsequence, Longest Common Subsequence, Longest Repeated Suffix Ending at each point in a word and Detection of Repetitions. We present also experimental results showing that our method is efficient.
متن کامل